Constructions in public-key cryptography over matrix groups

نویسندگان

  • Dimitri Grigoriev
  • Ilia V. Ponomarenko
چکیده

The purpose of the paper is to give new key agreement protocols (a multi-party extension of the protocol due to Anshel-Anshel-Goldfeld and a generalization of the Diffie-Hellman protocol from abelian to solvable groups) and a new homomorphic public-key cryptosystem. They rely on difficulty of the conjugacy and membership problems for subgroups of a given group. To support these and other known cryptographic schemes we present a general technique to produce a family of instances being matrix groups (over finite commutative rings) which play a role for these schemes similar to the groups Z n in the existing cryptographic constructions like RSA or discrete logarithm. ∗Partially supported by RFFI, grants, 03-01-00349, NSH-2251.2003.1. The paper was done during the stay of the author at the Mathematical Institute of the University of Rennes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations

GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...

متن کامل

Algebraic cryptography: new constructions and their security against provable break?

Very few known cryptographic primitives are based on noncommutative algebra. Each new scheme is of substantial interest, because noncommutative constructions are secure agains many standard cryptographic attacks. On the other hand, cryptography does not provide security proofs that would allow to base the security of a cryptographic primitive on structural complexity assumptions. Thus, it is im...

متن کامل

The discrete logarithm problem in the group of non-singular circulant matrices

The discrete logarithm problem is one of the backbones in public key cryptography. In this paper we study the discrete logarithm problem in the group of circulant matrices over a finite field. This gives rise to secure and fast public key cryptosystems.

متن کامل

Minimal Logarithmic Signatures for Sporadic Groups

As a special type of factorization of finite groups, logarithmic signature (LS) is used as the main component of cryptographic keys for secret key cryptosystems such as PGM and public key cryptosystems like MST1, MST2 and MST3. An LS with the shortest length is called a minimal logarithmic signature (MLS) and is even desirable for cryptographic constructions. The MLS conjecture states that ever...

متن کامل

Lightweight Symmetric-Key Hidden Vector Encryption without Pairings

Hidden vector encryption (HVE), introduced by Boneh and Waters in TCC’07, is an expressive sub-class of predicate encryption, that allows conjunctive, subset, range and comparison queries over encrypted data. All existing HVE constructions in the cryptographic literature use bilinear pairings over either composite order or prime order groups. In this paper, we address the open problem of constr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/math/0506180  شماره 

صفحات  -

تاریخ انتشار 2005